#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int size= 2e5;
int n,k;
cin>>n>>k;
int fre[200001]={0};
int arr[n];
int mini= INT_MAX;
for(int i=0; i<n; i++){
cin>>arr[i];
mini= min(mini, arr[i]);
}
for(int i=0; i<n; i++){
arr[i]=arr[i]-mini;
fre[arr[i]]++;
}
for(int i=2e5-1; i>=1; i--){
fre[i]+=fre[i+1];
}
// for(int i=1; i<5; i++){
// cout<<fre[i]<<" ";
// }
reverse(fre+1, fre+size);
int ct=0;
int i=1;
while(i<=size){
int sum=0;
while(i<=size){
if(sum+fre[i]<=k){
sum+=fre[i];
i++;
}else break;
}if(sum)ct++;
}
cout<<ct<<endl;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |